Efficient Jump Ahead for F2-linear Random Number Generators
نویسندگان
چکیده
Hiroshi Haramoto, Makoto Matsumoto Department of Mathematics, Hiroshima University, Kagamiyama 1-3-1 Higashi-Hiroshima, Hiroshima 739-8526, Japan {[email protected] and [email protected]} Takuji Nishimura Department of Mathematical Sciences, Yamagata University, Yamagata 990-8586, Japan {[email protected]} François Panneton and Pierre L’Ecuyer Département d’Informatique et de Recherche Opérationnelle, Université de Montréal C.P. 6128, Succ. Centre-Ville, Montréal, H3C 3J7, Canada {[email protected] and [email protected]}
منابع مشابه
Efficient Jump Ahead for 2-Linear Random Number Generators
T fastest long-period random number generators currently available are based on linear recurrences modulo 2. So far, software that provides multiple disjoint streams and substreams has not been available for these generators because of the lack of efficient jump-ahead facilities. In principle, it suffices to multiply the state (a k-bit vector) by an appropriate k × k binary matrix to find the n...
متن کاملA Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
Linear recurring sequences with very large periods are widely used as the basic building block of pseudorandom number generators. In many simulation applications, multiple streams of random numbers are needed, and these multiple streams are normally provided by jumping ahead in the sequence to obtain starting points that are far apart. For maximal-period generators having a large state space, t...
متن کاملResolution-stationary random number generators
Besides speed and period length, the quality of uniform random number generators is usually assessed by measuring the uniformity of their point sets, formed by taking vectors of successive output values over their entire period length. For F2-linear generators, the commonly adopted measures of uniformity are based on the equidistribution of the most significant bits of the output. In this paper...
متن کاملOn the F2-linear relations of Mersenne Twister pseudorandom number generators
Sequence generators obtained by linear recursions over the two-element field F2, i.e., F2-linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the most successful applications. An advantage of such generators is that we can assess them quickly by using theoretical criteria, such as the dimension of equidistribution with v-bit ...
متن کاملParallelisation Techniques for Random Number Generators
In this chapter, we discuss the parallelisation of three very popular random number generators. In each case, the random number sequence which is generated is identical to that produced on a CPU by the standard sequential algorithm. The key to the parallelisation is that each CUDA thread block generates a particular block of numbers within the original sequence, and to do this it needs an effic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006